Mints type deductive calculi for logic programming
نویسندگان
چکیده
منابع مشابه
Calculi for Disjunctive Logic Programming
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result ...
متن کاملCollaborative Logic Programming via Deductive-inductive Resolution
This thesis presents a powerful deductive-inductive resolution technique, by combining deductive theorem proving with inductive logic programming, for solving a new class of multi-agent problems—namely the collaborative logic programming (CollabLP) problems. In essence, the CollabLP formulation captures a wide range of problems in multi-agent settings where knowledge is typically distributed, p...
متن کاملFoundations of Deductive Databases and Logic Programming
Preparing the books to read every day is enjoyable for many people. However, there are still many people who also don't like reading. This is a problem. But, when you can support others to start reading, it will be better. One of the books that can be recommended for new readers is foundations of deductive databases and logic programming. This book is not kind of difficult book to read. It can ...
متن کاملDeductive Spreadsheets Using Tabled Logic Programming
Rule-based specifications in Datalog are used in a number of application areas, such as configuration management, access control and trust management, decision making, etc. However, rules sets are typically hard to maintain; the rules often interact in subtle ways, making them difficult to understand and reason about. This has impeded the wide-spread adoption of rule-based computing. This paper...
متن کاملRule-based Calculi for Extensions of Logic Programming
The focus of this paper lies on the proof-theory for extensions of Logic Programming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on the lack of a proof) way. These extensions are provided with a rule-based deductive system in the sense of the work of Jager [8] for Normal Logic Programs. Rule-based deductive syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1992
ISSN: 0168-0072
DOI: 10.1016/0168-0072(92)90065-8